The loop free logical topology created is called a tree 沒有?圈的邏輯拓?fù)浣凶鰳洹?
The algorithm used to create this loop free logical topology is the spanning - tree algorithm 用來建立沒有?圈的邏輯拓?fù)渲菟惴ㄍǔ7Q為擴充樹演算法。
It is because certain paths are blocked that a loop free topology is possible . data frames received on blocked links are dropped 因為某些特定的路徑被阻隔,所以才有可能建立沒有?圈的拓?fù)?。在阻隔連結(jié)上所收到的資料訊框?qū)⒈粊G棄。
A new algorithm called the rapid spanning - tree algorithm was developed to reduce the time for a network to compute a loop free logical topology 一個新的演算法叫做快速擴充樹演算法,是開發(fā)用來減少網(wǎng)路上,計算一個沒有?圈的邏輯拓?fù)渌璧臅r間。